Relocation Scheduling in a Two-Machine Flow Shop with Resource Recycling Operations

This paper considers a variant of the relocation problem, which is formulated from an urban renewal project. There set jobs to be processed in two-machine flow shop subject given initial resource level. Each job consumes some units start its processing on machine 1 and will return amount when it completed 2. The released by not necessarily equal acquired for starting process. Subject constraint, problem find feasible schedule whose makespan minimum. In this paper, we first prove NP-hardness two special cases. Two heuristic algorithms with different characteristics, permutation non-permutation, are designed construct schedules. Ant colony optimization (ACO) also proposed produce approximate solutions. We design conduct computational experiments appraise performances algorithms.